Term Dependence Graphs 1
نویسندگان
چکیده
Program slicing is a method for decomposing programs by analyzing their data and control flow. It has many applications in the field of software engineering (like program debugging, testing, code reuse, maintenance, etc). The so called program dependence graph—a data structure that stores control and data dependences between the statements of imperative programs—is a key ingredient of many slicing techniques. Unfortunately, there is no analogous data structure for rewrite systems (or functional programs), which is relevant for defining an associated program slicing technique. In this work, we present the definition of a new data structure, called term dependence graph, that can be used to fill this gap.
منابع مشابه
Notes on Lower-Bounds for Testing
Recall that we showed that there is an algorithm for testing triangle-freeness of dense graphs that had a dependence on 1/ that was quite high. While we cannot exactly match that dependence with a lower bound, we’ll show that a super-polynomial dependence is necessary. Here we’ll give the proof only for the one-sided error case, and note that it can be extended to two-sided error algorithms. Na...
متن کاملAugmentation of paired pulse index as short-term plasticity due to morphine dependence
Abstract* Introduction: Chronic morphine exposure can cause addiction and affect synaptic plasticity, but the underlying neural mechanisms of this phenomenon remain unknown. Herein we used electrophysiologic approaches in hippocampal CA1 area to examine the effect of chronic morphine administration on short-term plasticity. Methods: Experiments were carried out on hippocampal slices taken f...
متن کاملDimer λd Expansion, Dimension Dependence of ¯ Jn Kernels
In previous papers an asymptotic expansion for the dimer λd of the form λd ∼ 1 2 ln(2d)− 1 2 + c1 d + c2 d2 + · · · was developed. Kernels J̄n were a key ingredient in the theory. Herein we prove J̄n are of the form J̄n = Cr dr + Cr+1 dr+1 · · ·+ Cn−1 dn−1 with r ≥ n/2. 1 ar X iv :0 80 6. 19 41 v1 [ m at hph ] 1 1 Ju n 20 08 In a series of papers a new technique was introduced and applied for extr...
متن کاملCurrent algebra derivation of temperature dependence of hadron couplings with currents
The vector and the axial-vector meson couplings with the vector and the axial-vector currents respectively at finite temperature have been obtained in Ref. [1] by calculating all the relevant one-loop Feynman graphs with vertices obtained from the effective chiral Lagrangian. On the other hand, the same couplings were also derived in Ref. [3] by applying the method of current algebra and the hy...
متن کاملTimed Dependence Flow Graphs, an Intermediate Form for Veri ed High-level Synthesis
{We present timed dependence ow graphs, an intermediate form for high-level synthesis from speciications written in behavioral hardware description languages. Timed dependence ow graphs express data, control, resource access, and timing dependences, and can be constructed in linear time from behavioral VHDL descriptions. We also present a formal execution semantics for timed dependence ow graph...
متن کامل